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

Theorem karden 4698
Description: If we allow the Axiom of Regularity, we can avoid the Axiom of Choice by defining the cardinal number of a set as the set of all sets equinumerous to it and having least possible rank. This theorem proves the equinumerosity relationship for this definition (compare carden 4803). The hypotheses correspond to the definition of kard of [Enderton] p. 222 (which we don't define separately since currently we do not use it elsewhere). This theorem along with kardex 4697 justify the definition of kard. The restriction to least rank prevents the proper class that would result from {x | x ~~ A}.
Hypotheses
Ref Expression
karden.1 |- A e. V
karden.2 |- B e. V
karden.3 |- C = {x | (x ~~ A /\ A.y(y ~~ A -> (rank` x) (_ (rank` y)))}
karden.4 |- D = {x | (x ~~ B /\ A.y(y ~~ B -> (rank` x) (_ (rank` y)))}
Assertion
Ref Expression
karden |- (C = D <-> A ~~ B)
Distinct variable groups:   x,y,A   x,B,y

Proof of Theorem karden
StepHypRef Expression
1 karden.1 . . . . . . . 8 |- A e. V
21enref 4372 . . . . . . 7 |- A ~~ A
3 breq1 2612 . . . . . . . 8 |- (w = A -> (w ~~ A <-> A ~~ A))
41, 3cla4ev 1860 . . . . . . 7 |- (A ~~ A -> E.w w ~~ A)
52, 4ax-mp 7 . . . . . 6 |- E.w w ~~ A
6 abn0 2280 . . . . . 6 |- ({w | w ~~ A} =/= (/) <-> E.w w ~~ A)
75, 6mpbir 190 . . . . 5 |- {w | w ~~ A} =/= (/)
8 scott0 4689 . . . . . 6 |- ({w | w ~~ A} = (/) <-> {z e. {w | w ~~ A} | A.y e. {w | w ~~ A} (rank` z) (_ (rank` y)} = (/))
98necon3bii 1590 . . . . 5 |- ({w | w ~~ A} =/= (/) <-> {z e. {w | w ~~ A} | A.y e. {w | w ~~ A} (rank` z) (_ (rank` y)} =/= (/))
107, 9mpbi 189 . . . 4 |- {z e. {w | w ~~ A} | A.y e. {w | w ~~ A} (rank` z) (_ (rank` y)} =/= (/)
11 rabn0 2282 . . . 4 |- ({z e. {w | w ~~ A} | A.y e. {w | w ~~ A} (rank` z) (_ (rank` y)} =/= (/) <-> E.z e. {w | w ~~ A}A.y e. {w | w ~~ A} (rank` z) (_ (rank` y))
1210, 11mpbi 189 . . 3 |- E.z e. {w | w ~~ A}A.y e. {w | w ~~ A} (rank` z) (_ (rank` y)
13 pm3.26 319 . . . . . . . . 9 |- ((z ~~ A /\ A.y(y ~~ A -> (rank` z) (_ (rank` y))) -> z ~~ A)
1413a1i 8 . . . . . . . 8 |- (C = D -> ((z ~~ A /\ A.y(y ~~ A -> (rank` z) (_ (rank`
y))) -> z ~~ A))
15 karden.3 . . . . . . . . . . . 12 |- C = {x | (x ~~ A /\ A.y(y ~~ A -> (rank` x) (_ (rank` y)))}
16 karden.4 . . . . . . . . . . . 12 |- D = {x | (x ~~ B /\ A.y(y ~~ B -> (rank` x) (_ (rank` y)))}
1715, 16eqeq12i 1480 . . . . . . . . . . 11 |- (C = D <-> {x | (x ~~ A /\ A.y(y ~~ A -> (rank` x) (_ (rank` y)))} = {x | (x ~~ B /\ A.y(y ~~ B -> (rank` x) (_ (rank` y)))})
18 eq2ab 1565 . . . . . . . . . . 11 |- ({x | (x ~~ A /\ A.y(y ~~ A -> (rank` x) (_ (rank` y)))} = {x | (x ~~ B /\ A.y(y ~~ B -> (rank` x) (_ (rank` y)))} <-> A.x((x ~~ A /\ A.y(y ~~ A -> (rank` x) (_ (rank` y))) <-> (x ~~ B /\ A.y(y ~~ B -> (rank` x) (_ (rank` y)))))
1917, 18bitr 173 . . . . . . . . . 10 |- (C = D <-> A.x((x ~~ A /\ A.y(y ~~ A -> (rank` x) (_ (rank` y))) <-> (x ~~ B /\ A.y(y ~~ B -> (rank` x) (_ (rank` y)))))
20 breq1 2612 . . . . . . . . . . . . 13 |- (x = z -> (x ~~ A <-> z ~~ A))
21 fveq2 3709 . . . . . . . . . . . . . . . 16 |- (x = z -> (rank` x) = (rank`
z))
2221sseq1d 2078 . . . . . . . . . . . . . . 15 |- (x = z -> ((rank` x) (_ (rank` y) <-> (rank` z) (_ (rank` y)))
2322imbi2d 610 . . . . . . . . . . . . . 14 |- (x = z -> ((y ~~ A -> (rank` x) (_ (rank` y)) <-> (y ~~ A -> (rank` z) (_ (rank`
y))))
2423albidv 1273 . . . . . . . . . . . . 13 |- (x = z -> (A.y(y ~~ A -> (rank` x) (_ (rank` y)) <-> A.y(y ~~ A -> (rank` z) (_ (rank` y))))
2520, 24anbi12d 626 . . . . . . . . . . . 12 |- (x = z -> ((x ~~ A /\ A.y(y ~~ A -> (rank` x) (_ (rank` y))) <-> (z ~~ A /\ A.y(y ~~ A -> (rank` z) (_ (rank` y)))))
26 breq1 2612 . . . . . . . . . . . . 13 |- (x = z -> (x ~~ B <-> z ~~ B))
2722imbi2d 610 . . . . . . . . . . . . . 14 |- (x = z -> ((y ~~ B -> (rank` x) (_ (rank` y)) <-> (y ~~ B -> (rank` z) (_ (rank`
y))))
2827albidv 1273 . . . . . . . . . . . . 13 |- (x = z -> (A.y(y ~~ B -> (rank` x) (_ (rank` y)) <-> A.y(y ~~ B -> (rank` z) (_ (rank` y))))
2926, 28anbi12d 626 . . . . . . . . . . . 12 |- (x = z -> ((x ~~ B /\ A.y(y ~~ B -> (rank` x) (_ (rank` y))) <-> (z ~~ B /\ A.y(y ~~ B -> (rank` z) (_ (rank` y)))))
3025, 29bibi12d 627 . . . . . . . . . . 11 |- (x = z -> (((x ~~ A /\ A.y(y ~~ A -> (rank` x) (_ (rank` y))) <-> (x ~~ B /\ A.y(y ~~ B -> (rank` x) (_ (rank` y)))) <-> ((z ~~ A /\ A.y(y ~~ A -> (rank` z) (_ (rank` y))) <-> (z ~~ B /\ A.y(y ~~ B -> (rank` z) (_ (rank`
y))))))
3130a4v 1267 . . . . . . . . . 10 |- (A.x((x ~~ A /\ A.y(y ~~ A -> (rank` x) (_ (rank` y))) <-> (x ~~ B /\ A.y(y ~~ B -> (rank` x) (_ (rank` y)))) -> ((z ~~ A /\ A.y(y ~~ A -> (rank` z) (_ (rank` y))) <-> (z ~~ B /\ A.y(y ~~ B -> (rank` z) (_ (rank` y)))))
3219, 31sylbi 199 . . . . . . . . 9 |- (C = D -> ((z ~~ A /\ A.y(y ~~ A -> (rank` z) (_ (rank`
y))) <-> (z ~~ B /\ A.y(y ~~ B -> (rank` z) (_ (rank`
y)))))
33 pm3.26 319 . . . . . . . . 9 |- ((z ~~ B /\ A.y(y ~~ B -> (rank` z) (_ (rank` y))) -> z ~~ B)
3432, 33syl6bi 214 . . . . . . . 8 |- (C = D -> ((z ~~ A /\ A.y(y ~~ A -> (rank` z) (_ (rank`
y))) -> z ~~ B))
3514, 34jcad 598 . . . . . . 7 |- (C = D -> ((z ~~ A /\ A.y(y ~~ A -> (rank` z) (_ (rank`
y))) -> (z ~~ A /\ z ~~ B)))
36 entrt 4395 . . . . . . . 8 |- ((A ~~ z /\ z ~~ B) -> A ~~ B)
371ensym 4393 . . . . . . . 8 |- (z ~~ A -> A ~~ z)
3836, 37sylan 448 . . . . . . 7 |- ((z ~~ A /\ z ~~ B) -> A ~~ B)
3935, 38syl6 22 . . . . . 6 |- (C = D -> ((z ~~ A /\ A.y(y ~~ A -> (rank` z) (_ (rank`
y))) -> A ~~ B))
40 visset 1804 . . . . . . . 8 |- z e. V
41 breq1 2612 . . . . . . . 8 |- (w = z -> (w ~~ A <-> z ~~ A))
4240, 41elab 1888 . . . . . . 7 |- (z e. {w | w ~~ A} <-> z ~~ A)
43 df-ral 1641 . . . . . . . 8 |- (A.y e. {w | w ~~ A} (rank` z) (_ (rank` y) <-> A.y(y e. {w | w ~~ A} -> (rank` z) (_ (rank` y)))
44 visset 1804 . . . . . . . . . . 11 |- y e. V
45 breq1 2612 . . . . . . . . . . 11 |- (w = y -> (w ~~ A <-> y ~~ A))
4644, 45elab 1888 . . . . . . . . . 10 |- (y e. {w | w ~~ A} <-> y ~~ A)
4746imbi1i 186 . . . . . . . . 9 |- ((y e. {w | w ~~ A} -> (rank` z) (_ (rank` y)) <-> (y ~~ A -> (rank` z) (_ (rank` y)))
4847albii 996 . . . . . . . 8 |- (A.y(y e. {w | w ~~ A} -> (rank` z) (_ (rank`
y)) <-> A.y(y ~~ A -> (rank` z) (_ (rank` y)))
4943, 48bitr 173 . . . . . . 7 |- (A.y e. {w | w ~~ A} (rank` z) (_ (rank` y) <-> A.y(y ~~ A -> (rank` z) (_ (rank` y)))
5042, 49anbi12i 481 . . . . . 6 |- ((z e. {w | w ~~ A} /\ A.y e. {w | w ~~ A} (rank` z) (_ (rank` y)) <-> (z ~~ A /\ A.y(y ~~ A -> (rank` z) (_ (rank` y))))
5139, 50syl5ib 206 . . . . 5 |- (C = D -> ((z e. {w | w ~~ A} /\ A.y e. {w | w ~~ A} (rank