% Mizar problem: t15_net_1,net_1,358,5 
fof(t15_net_1, conjecture,  (! [A] :  ( (v1_net_1(A) & l1_petri(A))  =>  (! [B] :  (m1_subset_1(B, k2_net_1(A)) =>  ~ ( ( ~ (k2_net_1(A)=k1_xboole_0)  &  ( ~ (k5_net_1(A, B)=k1_tarski(B))  &  ~ (k5_net_1(A, B)=k3_net_1(A, B)) ) ) ) ) ) ) ) ).
fof(antisymmetry_r2_hidden, axiom,  (! [A, B] :  (r2_hidden(A, B) =>  ~ (r2_hidden(B, A)) ) ) ).
fof(asymmetry_r2_tarski, axiom,  (! [A, B] :  (r2_tarski(A, B) =>  ~ (r2_tarski(B, A)) ) ) ).
fof(cc1_relat_1, axiom,  (! [A] :  (v1_xboole_0(A) => v1_relat_1(A)) ) ).
fof(cc3_relat_1, axiom,  (! [A] :  ( (v1_xboole_0(A) & v1_relat_1(A))  =>  (v1_relat_1(A) & v3_relat_1(A)) ) ) ).
fof(cc4_relat_1, axiom,  (! [A] :  ( (v1_xboole_0(A) & v1_relat_1(A))  =>  (v1_relat_1(A) & v2_relat_1(A)) ) ) ).
fof(commutativity_k2_xboole_0, axiom,  (! [A, B] : k2_xboole_0(A, B)=k2_xboole_0(B, A)) ).
fof(d3_net_1, axiom,  (! [A] :  (l1_petri(A) => k2_net_1(A)=k2_xboole_0(u1_struct_0(A), u4_struct_0(A))) ) ).
fof(d3_xboole_0, axiom,  (! [A] :  (! [B] :  (! [C] :  (C=k2_xboole_0(A, B) <=>  (! [D] :  (r2_hidden(D, C) <=>  (r2_hidden(D, A) | r2_hidden(D, B)) ) ) ) ) ) ) ).
fof(d8_net_1, axiom,  (! [A] :  ( (v1_net_1(A) & l1_petri(A))  =>  (! [B] :  (m1_subset_1(B, k2_net_1(A)) =>  ( ~ (k2_net_1(A)=k1_xboole_0)  =>  (! [C] :  (C=k5_net_1(A, B) <=>  ( (r2_tarski(B, u1_struct_0(A)) => C=k1_tarski(B))  &  (r2_tarski(B, u4_struct_0(A)) => C=k3_net_1(A, B)) ) ) ) ) ) ) ) ) ).
fof(dt_k1_tarski, axiom, $true).
fof(dt_k1_xboole_0, axiom, $true).
fof(dt_k2_net_1, axiom, $true).
fof(dt_k2_xboole_0, axiom, $true).
fof(dt_k3_net_1, axiom, $true).
fof(dt_k5_net_1, axiom, $true).
fof(dt_l1_petri, axiom,  (! [A] :  (l1_petri(A) => l5_struct_0(A)) ) ).
fof(dt_l1_struct_0, axiom, $true).
fof(dt_l5_struct_0, axiom,  (! [A] :  (l5_struct_0(A) => l1_struct_0(A)) ) ).
fof(dt_m1_subset_1, axiom, $true).
fof(dt_u1_struct_0, axiom, $true).
fof(dt_u4_struct_0, axiom, $true).
fof(existence_l1_petri, axiom,  (? [A] : l1_petri(A)) ).
fof(existence_l1_struct_0, axiom,  (? [A] : l1_struct_0(A)) ).
fof(existence_l5_struct_0, axiom,  (? [A] : l5_struct_0(A)) ).
fof(existence_m1_subset_1, axiom,  (! [A] :  (? [B] : m1_subset_1(B, A)) ) ).
fof(fc1_xboole_0, axiom, v1_xboole_0(k1_xboole_0)).
fof(fc2_xboole_0, axiom,  (! [A] :  ~ (v1_xboole_0(k1_tarski(A))) ) ).
fof(fc3_relat_1, axiom,  (! [A, B] :  ( (v1_relat_1(A) & v1_relat_1(B))  => v1_relat_1(k2_xboole_0(A, B))) ) ).
fof(fc4_xboole_0, axiom,  (! [A, B] :  ( ~ (v1_xboole_0(A))  =>  ~ (v1_xboole_0(k2_xboole_0(A, B))) ) ) ).
fof(fc5_xboole_0, axiom,  (! [A, B] :  ( ~ (v1_xboole_0(A))  =>  ~ (v1_xboole_0(k2_xboole_0(B, A))) ) ) ).
fof(idempotence_k2_xboole_0, axiom,  (! [A, B] : k2_xboole_0(A, A)=A) ).
fof(rc1_relat_1, axiom,  (? [A] :  ( ~ (v1_xboole_0(A))  & v1_relat_1(A)) ) ).
fof(rc1_xboole_0, axiom,  (? [A] : v1_xboole_0(A)) ).
fof(rc2_relat_1, axiom,  (? [A] :  (v1_relat_1(A) & v2_relat_1(A)) ) ).
fof(rc2_xboole_0, axiom,  (? [A] :  ~ (v1_xboole_0(A)) ) ).
fof(redefinition_r2_tarski, axiom,  (! [A, B] :  (r2_tarski(A, B) <=> r2_hidden(A, B)) ) ).
fof(t1_boole, axiom,  (! [A] : k2_xboole_0(A, k1_xboole_0)=A) ).
fof(t1_subset, axiom,  (! [A] :  (! [B] :  (r2_tarski(A, B) => m1_subset_1(A, B)) ) ) ).
fof(t2_subset, axiom,  (! [A] :  (! [B] :  (m1_subset_1(A, B) =>  (v1_xboole_0(B) | r2_tarski(A, B)) ) ) ) ).
fof(t6_boole, axiom,  (! [A] :  (v1_xboole_0(A) => A=k1_xboole_0) ) ).
fof(t7_boole, axiom,  (! [A] :  (! [B] :  ~ ( (r2_tarski(A, B) & v1_xboole_0(B)) ) ) ) ).
fof(t8_boole, axiom,  (! [A] :  (! [B] :  ~ ( (v1_xboole_0(A) &  ( ~ (A=B)  & v1_xboole_0(B)) ) ) ) ) ).
