HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem brecop2 4300
Description: Binary relation on a quotient set. Lemma for real number construction. Eliminates antecedent from last hypothesis.
Hypotheses
Ref Expression
brecop2.1 |- S e. V
brecop2.2 |- B e. V
brecop2.3 |- C e. V
brecop2.4 |- D e. V
brecop2.5 |- dom S = (G X. G)
brecop2.6 |- H = ((G X. G)/.S)
brecop2.7 |- R (_ (H X. H)
brecop2.8 |- Q (_ (G X. G)
brecop2.9 |- -. (/) e. G
brecop2.10 |- dom F = (G X. G)
brecop2.11 |- (((A e. G /\ B e. G) /\ (C e. G /\ D e. G)) -> ([<.A, B>.]SR[<.C, D>.]S <-> (AFD)Q(BFC)))
Assertion
Ref Expression
brecop2 |- ([<.A, B>.]SR[<.C, D>.]S <-> (AFD)Q(BFC))

Proof of Theorem brecop2
StepHypRef Expression
1 brecop2.1 . . . . 5 |- S e. V
2 ecexg 4258 . . . . 5 |- (S e. V -> [<.C, D>.]S e. V)
31, 2ax-mp 7 . . . 4 |- [<.C, D>.]S e. V
4 brecop2.7 . . . 4 |- R (_ (H X. H)
53, 4brel 3219 . . 3 |- ([<.A, B>.]SR[<.C, D>.]S -> ([<.A, B>.]S e. H /\ [<.C, D>.]S e. H))
6 brecop2.6 . . . . . . 7 |- H = ((G X. G)/.S)
76eleq2i 1536 . . . . . 6 |- ([<.A, B>.]S e. H <-> [<.A, B>.]S e. ((G X. G)/.S))
8 opex 2778 . . . . . . 7 |- <.A, B>. e. V
9 brecop2.5 . . . . . . 7 |- dom S = (G X. G)
108, 9ecelqsdm 4292 . . . . . 6 |- ([<.A, B>.]S e. ((G X. G)/.S) -> <.A, B>. e. (G X. G))
117, 10sylbi 199 . . . . 5 |- ([<.A, B>.]S e. H -> <.A, B>. e. (G X. G))
12 brecop2.2 . . . . . 6 |- B e. V
1312opelxp 3210 . . . . 5 |- (<.A, B>. e. (G X. G) <-> (A e. G /\ B e. G))
1411, 13sylib 198 . . . 4 |- ([<.A, B>.]S e. H -> (A e. G /\ B e. G))
156eleq2i 1536 . . . . . 6 |- ([<.C, D>.]S e. H <-> [<.C, D>.]S e. ((G X. G)/.S))
16 opex 2778 . . . . . . 7 |- <.C, D>. e. V
1716, 9ecelqsdm 4292 . . . . . 6 |- ([<.C, D>.]S e. ((G X. G)/.S) -> <.C, D>. e. (G X. G))
1815, 17sylbi 199 . . . . 5 |- ([<.C, D>.]S e. H -> <.C, D>. e. (G X. G))
19 brecop2.4 . . . . . 6 |- D e. V
2019opelxp 3210 . . . . 5 |- (<.C, D>. e. (G X. G) <-> (C e. G /\ D e. G))
2118, 20sylib 198 . . . 4 |- ([<.C, D>.]S e. H -> (C e. G /\ D e. G))
2214, 21anim12i 333 . . 3 |- (([<.A, B>.]S e. H /\ [<.C, D>.]S e. H) -> ((A e. G /\ B e. G) /\ (C e. G /\ D e. G)))
235, 22syl 10 . 2 |- ([<.A, B>.]SR[<.C, D>.]S -> ((A e. G /\ B e. G) /\ (C e. G /\ D e. G)))
24 oprex 3978 . . . . 5 |- (BFC) e. V
25 brecop2.8 . . . . 5 |- Q (_ (G X. G)
2624, 25brel 3219 . . . 4 |- ((AFD)Q(BFC) -> ((AFD) e. G /\ (BFC) e. G))
27 brecop2.10 . . . . . 6 |- dom F = (G X. G)
28 brecop2.9 . . . . . 6 |- -. (/) e. G
2919, 27, 28ndmoprrcl 4041 . . . . 5 |- ((AFD) e. G -> (A e. G /\ D e. G))
30 brecop2.3 . . . . . 6 |- C e. V
3130, 27, 28ndmoprrcl 4041 . . . . 5 |- ((BFC) e. G -> (B e. G /\ C e. G))
3229, 31anim12i 333 . . . 4 |- (((AFD) e. G /\ (BFC) e. G) -> ((A e. G /\ D e. G) /\ (B e. G /\ C e. G)))
3326, 32syl 10 . . 3 |- ((AFD)Q(BFC) -> ((A e. G /\ D e. G) /\ (B e. G /\ C e. G)))
34 an42 507 . . 3 |- (((A e. G /\ D e. G) /\ (B e. G /\ C e. G)) <-> ((A e. G /\ B e. G) /\ (C e. G /\ D e. G)))
3533, 34sylib 198 . 2 |- ((AFD)Q(BFC) -> ((A e. G /\ B e. G) /\ (C e. G /\ D e. G)))
36 brecop2.11 . 2 |- (((A e. G /\ B e. G) /\ (C e. G /\ D e. G)) -> ([<.A, B>.]SR[<.C, D>.]S <-> (AFD)Q(BFC)))
3723, 35, 36pm5.21nii 678 1 |- ([<.A, B>.]SR[<.C, D>.]S <-> (AFD)Q(BFC))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 146   /\ wa 223   = wceq 955   e. wcel 957  Vcvv 1808   (_ wss 2044  (/)c0 2277  <.cop 2408   class class class wbr 2615   X. cxp 3164  dom cdm 3166  (class class class)co 3958  [cec 4252  /.cqs 4253
This theorem is referenced by:  ordpipq 5039  ltsrpr 5169
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 961  ax-gen 962  ax-8 963  ax-10 965  ax-11 966  ax-12 967  ax-13 968  ax-14 969  ax-17 970  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122  ax-10o 1139  ax-16 1209  ax-11o 1217  ax-ext 1458  ax-sep 2699  ax-pow 2738  ax-pr 2775  ax-un 2862
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 776  df-ex 980  df-sb 1171  df-eu 1381  df-mo 1382  df-clab 1463  df-cleq 1468  df-clel 1471  df-ne 1585  df-ral 1647  df-rex 1648  df-v 1809  df-dif 2046  df-un 2047  df-in 2048  df-ss 2050  df-nul 2278  df-pw 2399  df-sn 2409  df-pr 2410  df-op 2413  df-uni 2500  df-br 2616  df-opab 2663  df-xp 3180  df-cnv 3182  df-dm 3184  df-rn 3185  df-res 3186  df-ima 3187  df-fv 3194  df-opr 3960  df-ec 4256  df-qs 4259
Copyright terms: Public domain